Cyclability in bipartite graphs
نویسندگان
چکیده
منابع مشابه
Cyclability in Bipartite Graphs
Let G = (X, Y ; E) be a balanced 2-connected bipartite graph and S ⊂ V(G). We will say that S is cyclable in G if all vertices of S belong to a common cycle in G. We give sufficient degree conditions in a balanced bipartite graph G and a subset S ⊂ V(G) for the cyclability of the set S.
متن کاملNeighborhood unions and cyclability of graphs
A graph G is said to be cyclable if for each orientation → G of G, there exists a set S of vertices such that reversing all the arcs of → G with one end in S results in a hamiltonian digraph. Let G be a 3-connected graph of order n¿ 36. In this paper, we show that if for any three independent vertices x1, x2 and x3, |N (x1) ∪ N (x2)|+ |N (x2) ∪ N (x3)|+ |N (x3) ∪ N (x1)|¿ 2n+ 1, then G is cycla...
متن کاملAn Implicit Degree Condition for Cyclability in Graphs
A vertex subset X of a graph G is said to be cyclable in G if there is a cycle in G containing all vertices of X. Ore [6] showed that the vertex set of G with cardinality n ≥ 3 is cyclable (i.e. G is hamiltonian) if the degree sum of any pair of nonadjacent vertices in G is at least n. Shi [8] and Ota [7] respectively generalized Ore’s result by considering the cyclability of any vertex subset ...
متن کاملColourings in Bipartite Graphs
The concept of X-chromatic partition and hyper independent chromatic partition of bipartite graphs were introduced by Stephen Hedetniemi and Renu Laskar. We find the bounds for X-chromatic number and hyper independent chromatic number of a bipartite graph. The existence of bipartite graph with χh(G)=a and γY(G)=b-1, χh(G)=a and χX(G)=b where a ≤b are proved. We also prove the existence of bipar...
متن کاملCrowns in bipartite graphs
A set S ⊆ V (G) is stable (or independent) if no two vertices from S are adjacent. Let Ψ(G) be the family of all local maximum stable sets [6] of graph G, i.e., S ∈ Ψ(G) if S is a maximum stable set of the subgraph induced by S ∪ N(S), where N(S) is the neighborhood of S. If I is stable and there is a matching from N(I) into I, then I is a crown of order |I|+ |N(I)|, and we write I ∈ Crown(G) [...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Opuscula Mathematica
سال: 2009
ISSN: 1232-9274
DOI: 10.7494/opmath.2009.29.4.345